Endomorphisms of finite full transformation semigroups

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Variants of finite full transformation semigroups

The variant of a semigroup S with respect to an element a ∈ S, denoted S, is the semigroup with underlying set S and operation ? defined by x ? y = xay for x, y ∈ S. In this article, we study variants T a X of the full transformation semigroup TX on a finite set X. We explore the structure of T a X as well as its subsemigroups Reg(T a X) (consisting of all regular elements) and E X (consisting ...

متن کامل

compactifications and representations of transformation semigroups

this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...

15 صفحه اول

Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances

Let ΩΩ be the semigroup of all mappings of a countably infinite set Ω. If U and V are subsemigroups of ΩΩ, then we write U ≈ V if there exists a finite subset F of ΩΩ such that the subgroup generated by U and F equals that generated by V and F . The relative rank of U in ΩΩ is the least cardinality of a subset A of ΩΩ such that the union of U and A generates ΩΩ. We study the notions of relative...

متن کامل

UNIVERSAL COMPACTIFICATIONS OF TRANSFORMATION SEMIGROUPS

We extend the notion of semigroup compactification to the class of transformation semigroups, and determine the compactifications which are universal with respect to some topological properties.

متن کامل

Green's Relations in Finite Transformation Semigroups

We consider the complexity of Green’s relations when the semigroup is given by transformations on a finite set. Green’s relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then correspond to the strongly connected components. It is not difficult to show that, in the worst case, the number of equivalence classes is in the same order of mag...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 1998

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-98-04764-9